Bound Consistency on Linear Constraints in Finite Domain Constraint
نویسندگان
چکیده
This paper discusses the complexity of bound consistency on n-ary linear constraint system and investigates the relationship between equivalent binary equation systems from the perspective of bound consistency techniques. We propose an efficient bound consistency enforcing algorithm whose complexity is .In addition, by transforming a binary equation system into solved form, an efficient consistency enforcing algorithm can be achieved.
منابع مشابه
Programming finite-domain constraint propagators in Action Rules
In this paper, we propose a new language construct, called AR (Action Rules), and describe how various propagators for finite-domain constraints can be implemented in it. An action rule specifies a pattern for agents, an action that the agents can carry out, and an event pattern for events that can activate the agents. AR combines the goal-oriented execution model of logic programming with the ...
متن کاملConstraint propagation in Mozart
This thesis presents constraint propagation in Mozart which is based on computational agents called propagators. The thesis designs, implements, and evaluates propagator-based propagation engines. A propagation engine is split up in generic propagation services and domain specific domain solvers which are connected by a constraint programming interface. Propagators use filters to perform constr...
متن کاملDisjoint, Partition and Intersection Constraints for Set and Multiset Variables
We have started a systematic study of global constraints on set and multiset variables. We consider here disjoint, partition, and intersection constraints. These global constraints fall into one of three classes. In the first class, we show that we can decompose the constraint without hindering bound consistency. No new algorithms therefore need be developed for such constraints. In the second ...
متن کاملFinite Domain Constraints in Constraint Logic Programming
We describe the techniques used in finite domain contraint solvers in the Constraint Logic Programming (CLP) paradigm and present the language and system clp(FD) developped at INRIA. These schemes are based on local propagation techniques developed for finite domain constraints. Such techniques stem from Constraint Satisfaction Problems in Artificial Intelligence and have been introduced in Con...
متن کامل3D gravity data-space inversion with sparseness and bound constraints
One of the most remarkable basis of the gravity data inversion is the recognition of sharp boundaries between an ore body and its host rocks during the interpretation step. Therefore, in this work, it is attempted to develop an inversion approach to determine a 3D density distribution that produces a given gravity anomaly. The subsurface model consists of a 3D rectangular prisms of known sizes ...
متن کامل